Ela Computation of Eigenvalue and Eigenvector Derivatives for a General Complex-valued Eigensystem∗
نویسندگان
چکیده
In many engineering applications, the physical quantities that have to be computed are obtained by solving a related eigenvalue problem. The matrix under consideration and thus its eigenvalues usually depend on some parameters. A natural question then is how sensitive the physical quantity is with respect to (some of) these parameters, i.e., how it behaves for small changes in the parameters. To find this sensitivity, eigenvalue and/or eigenvector derivatives with respect to those parameters need to be found. A method is provided to compute first order derivatives of the eigenvalues and eigenvectors for a general complex-valued, non-defective matrix.
منابع مشابه
Ela Using Least-squares to Find an Approximate Eigenvector∗
The least-squares method can be used to approximate an eigenvector for a matrix when only an approximation is known for the corresponding eigenvalue. In this paper, this technique is analyzed and error estimates are established proving that if the error in the eigenvalue is sufficiently small, then the error in the approximate eigenvector produced by the least-squares method is also small. Also...
متن کاملRobust Eigensystem Assignment for Flexible Structures
An improved method is developed for eigenvalue and eigenvector placement of a closed-loop control system using either state or output feedback. The method basically consists of three steps. First, the singular value or QR decomposition is used to generate an orthonormal basis that spans admissible eigenvector space corresponding to each assigned eigenvalue. Second, given a unitary matrix, the e...
متن کاملEla Sensitivity Analysis for the Multivariate
This paper concerns with the sensitivity analysis for the multivariate eigenvalue problem (MEP). The concept of a simple multivariate eigenvalue of a matrix is generalized to the MEP and the first-order perturbation expansions of a simple multivariate eigenvalue and the corresponding multivariate eigenvector are presented. The explicit expressions of condition numbers, perturbation upper bounds...
متن کاملEla on the Main Signless Laplacian Eigenvalues of a Graph
A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...
متن کاملEla Matrices Totally Positive Relative to a Tree∗
It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has an alternating sign pattern. Here, a certain weakening of the TP hypothesis is shown to yield a similar conclusion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007